Arithmetical Sacks Forcing
نویسندگان
چکیده
We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented.
منابع مشابه
Projective Absoluteness under Sacks Forcing
We show that Σ3-absoluteness under Sacks forcing is equivalent to the Sacks measurability of every ∆2 set of reals. We also show that Sacks forcing is the weakest forcing notion among all of the preorders which always add a new real with respect to Σ3 forcing absoluteness.
متن کاملConsistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property
(See below for a definition of the Sacks property.) A “definable” variant of this question has been answered in [Sh 480]: Every nontrivial Souslin forcing notion which has the Sacks property has an uncountable antichain. (A Souslin forcing notion is a forcing notion for which the set of conditions, the comparability relation and the incompatibility relation are all analytic subsets of the reals...
متن کاملApplications of Forcing to the Degree-theory of the Arithmetical Hierarchy
Introduction It has been remarked by Addison ([1]) and Hinman ([6]) that applications of forcing techniques (Cohen ([2]), Feferman ([3])) often allow results about recursiveness to be extended to higher levels of the arithmetical (and hyperarithmetical) hierarchy. In this paper we present a description of the forcing method, and then use this technique to obtain generalizations of some well-kno...
متن کاملSacks forcing, Laver forcing, and Martin's axiom
In this paper we study the question assuming MA+¬CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalant to question of what is the additivity of Marczewski’s ideal s. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals. Introduction Let S be Sacks perfe...
متن کاملN - Localization Property
The present paper is concerned with the n–localization property and its preservation in countable support (CS) iterations. This property was first introduced in Newelski and Ros lanowski [10, p. 826]. Definition 0.1. Let n be an integer greater than 1. (1) A tree T is an n–ary tree provided that (∀s ∈ T)(|succ T (s)| ≤ n). (2) A forcing notion P has the n–localization property if P " ∀f ∈ ω ω ∃...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 45 شماره
صفحات -
تاریخ انتشار 2006